Generalized limited packings of some graphs with a limited number of P4-partners
نویسندگان
چکیده
منابع مشابه
Limited Packings in Graphs
A set of sensors is to be deployed to covertly monitor a facility. If too many sensors are placed close to any given location in the facility, then it is likely the presence of the sensors will be detected. Where then should the sensors be placed so that the total number we deploy is maximized while at the same time we avoid placing some threshold number close to any given location? There are m...
متن کاملBounds and algorithms for limited packings in graphs
We consider (closed neighbourhood) packings and their generalization in graphs called limited packings. A vertex set X in a graphG is a k-limited packing if for any vertex v ∈ V (G), |N [v] ∩X | ≤ k, where N [v] is the closed neighbourhood of v. The k-limited packing number Lk(G) is the largest size of a k-limited packing in G. Limited packing problems can be considered as secure facility locat...
متن کاملThe probabilistic approach to limited packings in graphs
We consider (closed neighbourhood) packings and their generalization in graphs. A vertex set X in a graph G is a k-limited packing if for any vertex v ∈ V (G), |N [v] ∩X| ≤ k, where N [v] is the closed neighbourhood of v. The k-limited packing number Lk(G) of a graph G is the largest size of a k-limited packing in G. Limited packing problems can be considered as secure facility location problem...
متن کاملAnti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملConstructing graphs with limited resources
We discuss the amount of physical resources required to construct a given graph, where vertices are added sequentially. We naturally identify information – distinct into instructions and memory – and randomness as resources. Not surprisingly, we show that, in this framework, threshold graphs are the simplest possible graphs, since the construction of threshold graphs requires a single bit of in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2015
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2014.11.014